A Hybrid Ant Colony Algorithm for Quadratic Assignment Problem
نویسندگان
چکیده
منابع مشابه
A Hybrid Ant Colony Algorithm for Quadratic Assignment Problem
Quadratic assignment problem (QAP) is one of fundamental combinatorial optimization problems in many fields. Many real world applications such as backboard wiring, typewriter keyboard design and scheduling can be formulated as QAPs. Ant colony algorithm is a multi-agent system inspired by behaviors of real ant colonies to solve optimization problems. Ant colony optimization (ACO) is one of new ...
متن کاملAnt Colony Optimization for Quadratic Assignment Problem
THE quadratic assignement problem (QAP) can be described as an optimizing the assignment a set of facilities to a set of locations with given costs between the locations and given flows between the facilities in order to minimize the sum of the product between flows and distances. A concrete example, would be a hospital planning optimization the location of various medical facilities in order t...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملHybrid Ant System Algorithm for Solving Quadratic Assignment Problems
-In this paper a hybrid variant of meta-heuristic algorithm ant colony optimization (ACO) is used. Approximate solutions to quadratic assignment problem have been proved very efficient. Different variants of ant colony optimization have been applied to QAP. But in this paper a hybrid approach is proposed which is combination of Ant system and Max-Min Ant system to take benefits of both the meth...
متن کاملAnt Colony Algorithm for the Single Loop Routing Problem
In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Electrical & Electronic Engineering Journal
سال: 2013
ISSN: 1874-1290
DOI: 10.2174/1874129001307010051